A Proof for Bisection Width of Grids
نویسندگان
چکیده
The optimal bisection width of r-dimensional N× · · · ×N grid is known to be N when N is even, but when N is odd, only approximate values are available. This paper shows that the exact bisection width of grid is N r −1
منابع مشابه
Alliances and Bisection Width for Planar Graphs
An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polynomial time. We base this on a proof of an upper bound of n on the bisection width for 4-connected pl...
متن کاملOn Alliance Partitions and Bisection Width for Planar Graphs
An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show how to construct infinitely many non-trivial examples of graphs that can not be partitioned into alliances and we show that any planar graph with minimum degree at least 4 can be split into two...
متن کاملThe relationship between the gossip complexity in vertex-disioint Daths mode and the vertex J bisekion width*
The one-way and two-way communication modes used for sending messages to processors of interconnection networks via vertex-disjoint paths in one communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). This paper reveals a direct relationship between the gossip complexity and the vertex bisection width. More preci...
متن کاملGraph Bisection AlgoriLhrns With Good A-veragc Case Behavior
In the paper, we describe a polynomial time algorithm that, for every input graph, either outputs the minimum bisection of the graph or halts without output. More importantly, we show that the algorithm chooses the former course with high probability for many natural classes of graphs. In particular, for every fixed d 2 3, all suffciently large n and all b = o(nl l / lT j ) , the algorithm find...
متن کاملGraph bisection algorithms
In this thesis, we describe a polynomial time algorithm that, for every input graph, either outputs the minimum bisection of the graph or halts without output. More importantly, we show that the algorithm chooses the former course with high probability for many natural classes of graphs. In particular, for every fixed d > 3, all sufficiently large n and all b = o(ni-1/d2lJ), the algorithm finds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009